Polymorphisms in cyclically-varying environments
نویسندگان
چکیده
منابع مشابه
MDPs: Learning in Varying Environments
In this paper ε-MDP-models are introduced and convergence theorems are proven using the generalized MDP framework of Szepesvári and Littman. Using this model family, we show that Q-learning is capable of finding near-optimal policies in varying environments. The potential of this new family of MDP models is illustrated via a reinforcement learning algorithm called event-learning which separates...
متن کاملDynamically Varying Environments
The vast majority of work to date concerned with obstacle avoidance for manipulators has dealt with task descriptions in the form ofpick-and-place movements. The added flexibility in motion control for manipulators possessing redundant degrees offreedom permits the consideration of obstacle avoidance in the context of a specified end-effector trajectory as the task description. Such a task defi...
متن کاملGranular shear flow in varying gravitational environments
Despite their very low surface gravities, asteroids exhibit a number of different geological processes involving granular matter. Understanding the response of this granular material subject to external forces in microgravity conditions is vital to the design of a successful asteroid sub-surface sampling mechanism, and in the interpretation of the fascinating geology on an asteroid. We have des...
متن کاملProtecting haploid polymorphisms in temporally variable environments.
Analysis of a continuous-time model shows that a protected polymorphism can arise in a haploid population subject to temporal fluctuations in selection. The requirements are that population size is regulated in a density-dependent manner and that an allele's arithmetic mean relative growth rate is greater than one when rare and that its harmonic mean relative growth rate is less than one when c...
متن کاملDirect Memory Schemes for Population-Based Incremental Learning in Cyclically Changing Environments
The population-based incremental learning (PBIL) algorithm is a combination of evolutionary optimization and competitive learning. The integration of PBIL with associative memory schemes has been successfully applied to solve dynamic optimization problems (DOPs). The best sample together with its probability vector are stored and reused to generate the samples when an environmental change occur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Heredity
سال: 1975
ISSN: 0018-067X,1365-2540
DOI: 10.1038/hdy.1975.67